Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees
نویسنده
چکیده
An algorithm is designed which tests solvability of a system of k polynomial equations in n variables with degrees d within complexity polynomial in nd 3k . If a systems is solvable then the algorithm yields one of its solutions. Thus, for fixed d, k the complexity of the algorithm is polynomial.
منابع مشابه
Resolution of Fuzzy Complex Systems of Linear Equations Via Wu's Method
The aim of this paper is to present algebraic method which is called Wu's method to solving fuzzy complex systems of linear equations. Wu's method is used as a solution procedure for solving the crisp polynomial equations system. This algorithm leads to solving characteristic sets that are amenable to easy solution. To illustrate the easy application of the proposed method, numerical examples a...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملA Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases
In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...
متن کاملComparative study on solving fractional differential equations via shifted Jacobi collocation method
In this paper, operational matrices of Riemann-Liouville fractional integration and Caputo fractional differentiation for shifted Jacobi polynomials are considered. Using the given initial conditions, we transform the fractional differential equation (FDE) into a modified fractional differential equation with zero initial conditions. Next, all the existing functions in modified differential equ...
متن کاملComputing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
We present a new probabilistic method for solving systems of polynomial equations and inequations. Our algorithm computes the equidimensional decomposition of the Zariski closure of the solution set of such systems. Each equidimensional component is encoded by a generic fiber, that is a finite set of points obtained from the intersection of the component with a generic transverse affine subspac...
متن کامل